Casper Hakfoort (1955–99)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending CasPer: A Regression Survey

The CasPer algorithm is a constructive neural network algorithm. CasPer creates cascade network architectures in a similar manner to Cascade Correlation. CasPer, however, uses a modified form of the RPROP algorithm, termed Progressive RPROP, to train the whole network after the addition of each new hidden neuron. Previous work with CasPer has shown that it builds networks which generalise bette...

متن کامل

Casper the Friendly Finality Gadget

We introduce Casper, a proof of stake-based finality system which overlays an existing proof of work blockchain. Casper is a partial consensus mechanism combining proof of stake algorithm research and Byzantine fault tolerant consensus theory. We introduce our system, prove some desirable features, and show defenses against long range revisions and catastrophic crashes. The Casper overlay provi...

متن کامل

CASPER: A Case-Based Poker-Bot

This paper investigates the use of the case-based reasoning methodology applied to the game of Texas hold’em poker. The development of a CASe-based Poker playER (CASPER) is described. CASPER uses knowledge of previous poker scenarios to inform its betting decisions. CASPER improves upon previous case-based reasoning approaches to poker and is able to play evenly against the University of Albert...

متن کامل

Extending and Benchmarking the CasPer Algorithm

The CasPer algorithm is a constructive neural network algorithm. CasPer creates cascade network architectures in a similar manner to Cascade Correlation. CasPer, however, uses a modified form of the RPROP algorithm, termed Progressive RPROP, to train the whole network after the addition of each new hidden neuron. Previous work with CasPer has shown that it builds networks which generalise bette...

متن کامل

CASPER: Intelligent capacity-aware evacuation routing

We propose a new method to perform urban routing efficiently under capacity constraints. This new method helps with evacuation routing as well as other urban transportation challenges. Traditionally, simulation software or shortest path routing combined with zonal scheduling have been used to solve routing problems. Our method utilizes a state-of-the-art algorithm to connect each source node to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The British Journal for the History of Science

سال: 2000

ISSN: 0007-0874,1474-001X

DOI: 10.1017/s0007087499003970